scalabl graph cluster stochast flow applic commun discoveri venu satuluri srinivasan parthasarathi algorithm base simul stochast flow simpl natur solut problem cluster graph widespread hamper lack scalabl fragment output articl present multi level algorithm graph cluster flow deliv signific improv qualiti speed graph success coarsen manag size small number iter flow simul perform coars graph graph success refin flow previou graph initi flow simul intermedi graph reach final refin graph algorithm run converg high flow region cluster region flow form natur boundari cluster extens experiment result real synthet dataset demonstr effect approach compar state art algorithm 